Cross-task code reuse in genetic programming applied to visual learning
نویسندگان
چکیده
منابع مشابه
Cross-task code reuse in genetic programming applied to visual learning
We propose a method that enables effective code reuse between evolutionary runs that solve a set of related visual learning tasks. We start with introducing a visual learning approach that uses genetic programming individuals to recognize objects. The process of recognition is generative, i.e., requires the learner to restore the shape of the processed object. This method is extended with a cod...
متن کاملLearning a visual task by genetic programming
This work describes a hand-eye system that can learn from its experience. The task is to visually guide the hand to reach a target while avoiding obstacles. The motion planning problem is solved by genetic programming. The system learns the forward kinematics by building a lookup table and uses it in the simulation run to generate robot programs that perform the task. The genetically created pr...
متن کاملGenetic Programming Applied to Strategies Learning
This study addresses the problem of knowledge acquisition to decision taken, applied to Tic -tac-toe game: a fix structure and rules, with a reasonable number of solutions, each one carrying to a different result (win, lost or tie). The comparative study focus the case where all possible states are modelled by genetic p rogramming, and a set of rules are applied against the opponent. The other ...
متن کاملGenetic Programming with Cross-task Knowledge Sharing for Learning of Visual Concepts
This thesis concentrates in the fields of computer vision, image understanding and machine learning. We present a novel approach for learning visual concepts from raw image data. Our method is able to learn new concepts and, in result, acquire knowledge that can be than used in standard computer vision tasks such as pattern recognition, object identification or object tracking. The acquired kno...
متن کاملGenetic Programming Applied to Mixed Integer Programming
We present the application of Genetic Programming (GP) in Branch and Bound (B&B) based Mixed Integer Linear Programming (MIP). The hybrid architecture introduced employs GP as a node selection expression generator: a GP run, embedded into the B&B process, exploits the characteristics of the particular MIP problem being solved, evolving a problem-specific node selection method. The evolved metho...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Applied Mathematics and Computer Science
سال: 2014
ISSN: 1641-876X
DOI: 10.2478/amcs-2014-0014